Analysis of Eigenvalue Bounds for Real Symmetric Interval Matrices
نویسندگان
چکیده
In this paper, we present several verifiable conditions for eigenvalue intervals of real symmetric interval matrices overlapping or not overlapping. To above cases, two new methods with algorithms for computing eigenvalue bounds of real symmetric matrices are developed. We can estimate eigenvalue bounds moving away the assumption that two intervals containing two eigenvalues of real symmetric interval matrices are not overlapping. These methods can analyse stability of systems in control fields extensively. Numerical examples illustrating the applicability and effectiveness of the new methods are also provided.
منابع مشابه
A filtering method for the interval eigenvalue problem
We consider the general problem of computing intervals that contain the real eigenvalues of interval matrices. Given an outer estimation of the real eigenvalue set of an interval matrix, we propose a filtering method that improves the estimation. Even though our method is based on an sufficient regularity condition, it is very efficient in practice, and our experimental results suggest that, in...
متن کاملCharacterizing and approximating eigenvalue sets of symmetric interval matrices
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner approximation algorithm, that in many case estimates exact bounds. To our knowledge, this is the first algorithm that is able to guarantee exactness. We illus...
متن کاملProperties of Central Symmetric X-Form Matrices
In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.
متن کاملBounds on Real Eigenvalues and Singular Values of Interval Matrices
We study bounds on real eigenvalues of interval matrices, and our aim is to develop fast computable formulae that produce as-sharp-as-possible bounds. We consider two cases: general and symmetric interval matrices. We focus on the latter case, since on one hand such interval matrices have many applications in mechanics and engineering, and on the other many results from classical matrix analysi...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کامل